Single Source-single Destination Coordination Chapter-2 Single Source-single Destination Coordination

نویسنده

  • Sandhya Makkar
چکیده

Supply chains (SC) are generally complex and are characterized by numerous activities spread over multiple functions and organizations, which pose interesting challenges for effective SC coordination. To meet these challenges, SC members must work towards a unified system and coordinate with each other. Importance of coordination in SC has escalated many folds. SC coordination requires that each stage take into account the effects of its actions on the other stages. Lack of coordination results when objectives of different stages conflict or information moving between stages is distorted. As a part of SCM literature and practice, it has long been recognised that there can be significant gains in integrating procurement and transportation decisions. Many companies rely on the third party carrier for transportation of goods from supply location to retail or consumption point. Freight rate discounts depending on shipment size has become a common practice, [Carter and Ferrin (1996)]. The freight costs are usually in the form of discounts tariffs in the quantity, which reflects economies of scale. The quantity to order at a given time must be determined by balancing two factors: 1) the cost of possessing or carrying materials 2) the cost of acquiring or ordering materials. Purchasing larger quantities may decrease the unit cost of acquisition, but this saving may not be more than offset by the cost of carrying materials in stock for a longer period of time.1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Study of Untrusted Relay Network Utilizing Cooperative Jammer

Abstract—In this paper, the problem of secure transmission in two-hop amplify-and-forward (AF) systems with an untrusted relay is investigated. To prevent the untrusted relay from intercepting the source message and to achieve positive secrecy rate, the destination-based cooperative jamming (DBCJ) technique is used. In this method the destination sends an intended jamming signal to the relay. T...

متن کامل

Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

متن کامل

A Discovery Method for Node-disjoint Multi-paths by Valid Source- Destination Edges

In Ad hoc networks most on demand routing protocols concentrate on the single path from a source to a destination. Exhaustively using a single path increases traffic load and faster consumes energy of nodes on the path. Therefore, preventing concentration on a single path and distribution of energy and traffic load on whole network is an important issue on Ad hoc networks. Some searching method...

متن کامل

Single cycle supply chain coordination model for fuzzy stochastic demand of perishable items

Market demand of the  perishable bakery  products are volatile. Hence, demand of such items are random variable. The most appealing demand distribution of such items is lognormal demand distribution. Using historical data, the parameters of lognormal distribution are obtained. But, there is a problem of overestimation or underestimation of the parameters. Fuzzy triangular numbers are used to ov...

متن کامل

Linear Sphericity Testing of 3-Connected Single Source Digraphs

It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005